Higher Polynomial Identities for Mutations of Associative Algebras

We study polynomial identities satisfied by the mutation product \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$xpy - yqx$$\end{document}xpy-yqx on the underlying vector space of an associative algebra A, where p, q are fixed elements of A. We simplify known results for identities in degree 4, proving that only two identities are necessary and sufficient to generate them all; in degree 5, we show that adding one new identity suffices; in degree 6, we demonstrate the existence of a significant number of new identities, which induce us to conjecture that the variety generated by mutation algebras of associative algebras is not finitely based.


ng vector spa
e of an associative algebra A, where p, q are fixed elements of A. We simplify known results for identities in degree 4, proving that only two identities are nece sary and sufficient to generate them all; in degree 5, we show that adding one new identity suffi es; in degree 6, we demonstrate the existence of a significant number of new identities, which induce us to conjecture that the variety generated by mutation algebras of associative algebras is not finitely based.

Introduction

Let A be an associative algebra over a field F of characteristic 0. Fix two elements p, q ∈ A an

Introduction
Let A be an associative algebra over a field F of characteristic 0. Fix two elements p, q ∈ A and define a new bilinear operation on the underlying vector space: define a new bilinear operation on the underlying vector space:

x * pq y = xpy − yqx.

The resulting nonassociative algebra A pq is called the pq-mutation of A.

Mutation algebras were introduced by theoretical physicists around 1980; see [8, equation (1.6b)] and [17, equation (66)].For a survey of early work by mathematicians on this topic, see [15].For a detailed exposition of the structure 0123456789().: V,-vol theory of mutation algebras, see [6].For mutations of nonassociative algebras, see [2].

To motivate the investigation of polynomial identities for mutati x * pq y = xpy − yqx.
The resulting nonassociative algebra A pq is called the pq-mutation of A.
To motivate the investigation of polynomial identities for mutation algebras, we paraphrase some comments from [6,Preface].Mutation algebras are both Lie-and Jordan-admissible, but they also satisfy other more complex identities of higher degree; see [6,Chapter 5].It is an open problem to determine a complete set of independent identities satisfied by all mutation algebras for arbitrary p, q.In fact, mutation algebras do not form a variety defined by polynomial identities.We note that Lie-and Jordan-admissible algebras were introduced by Albert in [1, IV. [1][2].
n algebras, we paraphrase some comments from [6,Preface].Mutation algebras are both Lie-and Jordan-admissible, but they also satisfy other more complex identities of higher degree; see [6,Chapter 5].It is an open problem to determine a complete set of independent identities satisfied by all ial identities.We note that Lie-and Jordan-admissible algebras were introduced by Albert in [1, IV. [1][2].

Polynomial identities for mutation algebras were first studied systematically by Montaner [14] using the classical techniques of nonassociative algeb Polynomial identities for mutation algebras were first studied systematically by Montaner [14] using the classical techniques of nonassociative algebra [16,18].That work did not consider the original operation * pq but decomposed it as the sum of commutative and anticommutative operations: a [16,18].That work did not consider the original operation * pq but decomposed it as the sum of commutative and anticommutative operations:

x * pq y = {x, y} + [x, y] where {x, y} = 1 2 (x * pq y + y * pq x), [x, y] = 1 2 (x * p x * pq y = {x, y} + [x, y] where {x, y} = 1 2 (x * pq y + y * pq x), [x, y] = 1 2 (x * pq y − y * pq x).For further information about the notion of polarization of a binary operation, see [12].Furthermore, the work of Montaner considered identities which are not necessarily multilinear, but hand calculation restricted the degree of the identities to n ≤ 4.
y − y * pq x).For further information about the notion of polarization of a binary operation, see [12].Furthermore, the work of Mon aner considered identities which are not necessarily multilinear, but hand calculation restricted the degree of the identities to n ≤ 4.

We use a different approach which allows us to simplify the known results in degree 4, to determine a complete set of identities in degree 5, and to demonstrate the existence of a significant number of new identities in degree 6:

• We use elementary concepts from the theory of algebraic operads [3,10,11,13].• Our main tool is computer algebra, in particular:

-Linear algebra over the rational n We use a different approach which allows us to simplify the known results in degree 4, to determine a complete set of identities in degree 5, and to demonstrate the existence of a significant number of new identities in degree 6: • We use elementary concepts from the theory of algebraic operads [3,10,11,13].• Our main tool is computer algebra, in particular: -Linear algebra over the rational numbers and finite prime fields: the row canonical form of a matrix using Gaussian elimination.-Linear algebra over the integers: the Hermite normal form of a matrix and the Lenstra-Lenstra-Lovász algorithm (LLL, see [5,9]) for lattice basis reduction.• We consider only multilinear identities for the original operation x * pq y: this allows us to use the representation theory of the symmetric group [4] to decompose the computations into small pieces corresponding to irreducible representations.

e fields: the row canonical f
rm of a matrix using Gaussian elimination.-Linear algebra over the integers: the Hermite normal form of a matrix and the Lenstra-Lenstra-Lovász algorithm (LLL, see [5,9]) for lattice basis reduction.• We consider only multilinear identities for the original operation x * pq y: this allows us to use the representation theory of the symmetric group [4] to decompose the computations into small pieces corresponding to irreducible representations.


Algebraic Operads


The Free Nonsymmetric Operad

We write T n for the set of all complete rooted plane binary trees with n leaves denoted by asterisks; for n = 1 there is only the exceptional tree with one leaf and no r

The Free Nonsymmetric Operad
We write T n for the set of all complete rooted plane binary trees with n leaves denoted by asterisks; for n = 1 there is only the exceptional tree with one leaf and no root, T 1 = { * }.Each tree in T n contains n−1 internal nodes (including the root); hence the size of T n is the Catalan number 1 n 2n−2 n−1 .We write U n for the set of all association types in degree n: balanced placements of parentheses in a sequence of n asterisks.There is a bijection μ n : T n → U n defined recursively: μ 1 ( * ) = * ; for every internal node v with left and right subtrees t 1 ∈ T n1 and t 2 ∈ T n2 we replace the subtree with root v by ( μ n1 (t In terms of association types, μ n1 (t 1 ) • i μ n2 (t 2 ) corresponds to substitution of ( μ n2 (t 2 ) ) for argument i of μ n1 (t 1 ); we omit the parentheses if n 2 = 1.For example, ( * * )( * * ) n−1 internal nodes (including the root); hence the size of T n is the Catalan numb r 1 n 2n−2 n−1 .We write U n for the set of all association types in degree n: balanced placements of parentheses in a sequence of n asterisks.There is a bijection μ n : T n → U n defined recursively: μ 1 ( * ) = * ; for every internal node v with left and right subtrees t 1 ∈ T n1 and t 2 ∈ T n2 we replace the subtree with root v by ( μ n1 (t In terms of association types, μ n1 (t 1 ) • i μ n2 (t 2 ) corresponds to substitution of ( μ n2 (t 2 ) ) for argument i of μ n1 (t 1 ); we omit the parentheses if n 2 = 1.For example, ( * * )( * * )
• 3 * ( * * ) = ( * * )(( * ( * * )) * ).
Partial composition is nonassociative but satis Partial composition is nonassociative but satisfies sequential and parallel axioms [3, Definition 3.2.2.3] (see also [10,13]).We state these axioms following [11,Definition 11 • j g) • i h = ⎧ ⎪ ⎨ ⎪ ⎩ (f • i h) • j+p−1 g 1 ≤ i ≤ j • i−j+1 h) j ≤ i ≤ n + j − 1 (f • i−n+1 h) • j g n+ j ≤ i ≤ m + n − 1 .
Let T denote the disjoint union of the T n for n ≥ 1:
T = n≥1 T n .
The set T together with all partial compositions is isomorphic to the free nonsymmetric set operad generated by one binary operation ω corresponding to the tree with root and two leaves.(Nonsymmetric means that we have no Let T denote the disjoint union of the T n for n ≥ 1: The set T together with all partial compositions is isomorphic to the free nonsymmetric set operad generated by one binary operation ω corresponding to the tree with root and two leaves.(Nonsymmetric means that we have not yet introduced the action of the symmetric group on the arguments.)Let T (n) denote the vector space with basis T n .On the direct sum d the action of the symmetric group on the arguments.)Let T (n) denote the vector space with basis T n .On the direct sum
T = n≥1 T (n),
we extend partial compositions so that they are linear in each factor.
we extend partial compositions so that they are linear in each factor.The vector space T together with the extended partial compositions is isomorphic to the free nonsymmetric vector operad generated by ω.

e vector space T together
ith the extended partial compositions is isomorphic to the free nonsymmetric vector operad generated by ω.


The
−−−−−−→ (x 6 x 5 )((x 4 (x 2 x 3 ))x 1 )
We extend partial compositions to labelled trees.Consider two labelled trees αt ∈ LT m and βu ∈ LT n .If 1 ≤ i ≤ m then the partial composition αt • i βu ∈ LT m+n−1 must be a tree with m+n−1 leaves labelled by a permutation in S m+n−1 .(Simple grafting of one labelled tree onto the other does not produce a permutation.)This must be done in a manner which is equivariant with respect to the action of the symmetric group.Following [13,Definion 1.37] with minor changes, we have:

• A leaf of αt with label j for 1 ≤ j ≤ α(i) − 1 retains its labe

The
We extend partial compositions to labelled trees.Consider two labelled trees αt ∈ LT m and βu ∈ LT n .If 1 ≤ i ≤ m then the partial composition αt • i βu ∈ LT m+n−1 must be a tree with m+n−1 leaves labelled by a permutation in S m+n−1 .(Simple grafting of one labelled tree onto the other does not produce a permutation.)This must be done in a manner which is equivariant with respect to the action of the symmetric group.Following [13,Definion 1.37] with minor changes, we have: • A leaf of αt with label j for 1 ≤ j ≤ α(i) − 1 retains its label.
is relabelled j + α(i) − 1.

• A leaf of αt with label j for α(i)
+ 1 ≤ j ≤ m is relabelled j + n − 1.
For Let LT (n) denote the S n -module with linear basis LT n ; we use the natural left action on labels (not on positions).The direct sum of these S n -modules,
LT = n≥1 LT (n),
together with the bilinear extension of the partial compositions, is isomorphic to the free symmetric vector operad generated by ω. (This binary operation has no symmetry: it is neither commutative nor an • A leaf of αt with label j for α(i) For Let LT (n) denote the S n -module with linear basis LT n ; we use the natural left action on labels (not on positions).The direct sum of these S n -modules, together with the bilinear extension of the partial compositions, is isomorphic to the free symmetric vector operad generated by ω. (This binary operation has no symmetry: it is neither commutative nor anticommutative.) icommutative.)

An ideal I in the free symmetric operad LT is a graded subspace (that is,
I(n) ⊆ LT (n) for n ≥ 1) such that • S n • I(n) = I(n): each homogeneous space I(n) is an S n -module (that is,
closed under the action An ideal I in the free symmetric operad LT is a graded subspace (that is, closed under the action of the symmetric group), and l compositions). The ideal f 1 , f 2 , . . . ⊆ LT generated by homogeneous elements f 1 , f 2 , . . . is the smallest ideal of LT containing f 1 , f 2 , . . . If I = f 1 , f 2 , . . . then we say that G = {f 1 , f 2 , .
. }
is a minimal set of generators for I if no proper subset of G generates I; this condition does not uniquely determine G.


Associativity, Nullary Operations, and the Expansion Map

In general, an n-ary operation (n ≥ 0) on a vector sp is a minimal set of generators for I if no proper subset of G generates I; this condition does not uniquely determine G.

Associativity, Nullary Operations, and the Expansion Map
In general, an n-ary operation (n ≥ 0) on a vector space V is a multilinear map f : so a unary operation is simply a linear operator on V ; for n = 0 we have V 0 = F, so a nullary operation is equivalent to the choice of a constant vector f (1) ∈ V .If we write End n (V ) for the vector space of all n-ary operations on V , then the direct sum End(V ) = n≥0 End n (V ), together with partial compositions (substitution of the output of one operation for an input of another operation), is the endomorphism operad of V .
V ), together with partial compositions (substitution of the output of one operation for an input of another operation), is the

ndomorphism operad of V .

Let p, q be symbols denoting n
Let p, q be symbols denoting nullary operations on some underlying vector space.For n ≥ 1, consider monomials llary operations on some underlying vector space.For n ≥ 1, consider monomials
v 1 v 2 • • • v 2n−1 with an odd number of factors such that the n odd-indexed factors v 2i−1 (1 ≤ i ≤ n) form a mul- tilinear associative monomial x α(1) • • • x α(n)
for some α ∈ S n , and each of the n − 1 even-indexed factors is either p or q.We write W n for the set of all such monomials; S n acts by permuting the odd-indexed factors.For v ∈ W m and w ∈ W n , we define v • i w ∈ W m+n−1 for 1 ≤ i ≤ m by substituting w for v 2i−1 (with the appropriate change of labels).We for some α ∈ S n , and each of the n − 1 even-indexed factors is either p or q.We write W n for the set of all such monomials; S n acts by permuting the odd-indexed factors.For v ∈ W m and w ∈ W n , we define v • i w ∈ W m+n−1 for 1 ≤ i ≤ m by substituting w for v 2i−1 (with the appropriate change of labels).We write W (n) for the vector space whose basis consists of all such monomials.The direct sum W = n≥1 W (n) is a suboperad of the symmetric associative operad with two nullary operations.

Figure 1. Expansions of basis monomials in degree 4
That is, we replace each internal node by the operation * pq .
If we represent trees by nonassociative monomials and leaf labels by letters then X 2 (ab) = apb − bqa and (1) For the expansions in degree 4, see Fig. 1.
Combining all the expansion maps we obtain the morphism of operads X : LT → W with kernel K = n≥1 K(n).The polynomial identities satisfied by * pq for all associative algebras A and all p, q ∈ A coincide with K, which is an operad ideal in LT .These identities are the linear dependence relations among the expansions of the nonassociative monomials.We refer to K(n) as the S n -module of all identities in degree n.
ial identities satisfied by * pq for all associative algebras A and all p, q ∈ A coincide with K, which is as the S n -module of all identities in degree n Our ultimate goal is to determine a set of generators for K.

Polynomial Identities in Degree n ≤ 3
Definition 3.1.In a nonassociative algebra, the Lie-admissible identity is associative algebra, the Lie-admissible identity is
L(a, b, c) = σ∈S3 ε(σ) (a σ b σ )c σ − a σ (b σ c σ ) ,
where ε : S 3 → {±1} is the sign homomorphism.If L(a, b, c) ≡ 0 then the commutator xy − yx satisfies the Jacobi identity.

We provide a different proof of the next result using elementary linear algebra.Theorem 3.2 [14].Over a field of characteristic 0, every multilinear polynomial identity in degree n ≤ 3 sat where ε : S 3 → {±1} is the sign homomorphism.If L(a, b, c) ≡ 0 then the commutator xy − yx satisfies the Jacobi identity.
We provide a different proof of the next result using elementary linear algebra.Theorem 3.2 [14].Over a field of characteristic 0, every multilinear polynomial identity in degree n ≤ 3 satisfied by every mutation of every associative algebra is a consequence of the Lie-admissible identity.( sfied by every mutation of every associative algebra is a con
and then by permutation of the variables: apbpc, apcpb, bpapc, bpcpa, cpapb, cpbpa, apbqc, apcqb, bpaqc, bpcqa, cpaqb, cpbq , aqbpc, aqcpb, bqapc, bqcpa, cqapb, cqbpa, aqbqc, aqcqb, bqaqc, bqcqa, cqaqb, cq qa.

(

The expansion map X 3 : LT (3) → W( 3) is determined by its values on the nonassociative monomials with the identity permutation of the arguments; see (1).We apply all permutations in S 3 to the arguments ( The expansion map X 3 : LT (3) → W( 3) is determined by its values on the nonassociative monomials with the identity permutation of the arguments; see (1).We apply all permutations in S 3 to the arguments a, b, c and store the coefficients of the monomials in the 24 × 12 matrix E 3 representing X 3 with respect to the ordered bases; see Fig. 2. That is, the (i, j) entry of E 3 is the coefficient of the ith associative monomial (3) in the expansion of the jth nonassociative monomial (2).It is easy to check that this matrix has rank 11 and hence nullity 1, and that a basis for its nullspace is the coefficient vector of the Lie-admissible identity.
a, b, c and store the coefficients of the monomials in the 24 × 12 matrix E 3 representing X 3 with respect to the ordered bases; see Fig. 2. That is, the (i, j) entry of E 3 is the coefficient of the i is ea y to check that th 1 and hence nullity 1, and that a basis for its nullspace is the coefficient vector of the Lie-admissible identity.


Polynomial Identities in Degree 4

Montaner [14] (see also [6,Chapter 5]) showed that every identity in degree n ≤ 4 satisfied by every mutation algebra is a consequence of the Lie-admissible identity, the Jordan-admissible identity, and two further identities; furthermore, none of these identities is a consequence of the other three.In this section we use computer algebra to simplify this result: we discover two new multilinear identities in degree 4, which are not consequences of the Lie-admi

Polynomial Identities in Degree 4
Montaner [14] (see also [6,Chapter 5]) showed that every identity in degree n ≤ 4 satisfied by every mutation algebra is a consequence of the Lie-admissible identity, the Jordan-admissible identity, and two further identities; furthermore, none of these identities is a consequence of the other three.In this section we use computer algebra to simplify this result: we discover two new multilinear identities in degree 4, which are not consequences of the Lie-admissible identity, and which generate all identities in degree 4 (including the Jordanadmissible identity).In identity H, the first three terms include a cyclic sum of associators [7, Equation ( 5)], and each term in the summation can be written as the difference of two associators.

new identities a
so generate the consequences of the Lie-admissible identity, and thus the latter do not need to be considered.Proof.We σ b σ )c σ )d σ , (a σ (b σ c σ ))d σ , (a σ b σ )(c σ d σ ), a σ ((b σ c σ )d σ ), a σ (b σ (c σ d σ )).
(4) The monomial basis of W( 4) consists of 192 elements ordered firs (4) The monomial basis of W( 4) consists of 192 elements ordered first by lex order of the triple of nullary operations and then by lex order of permutations σ ∈ S 4 : a σ p b σ p c σ p d σ , a σ p b σ p c σ q d σ , a σ p b σ q c σ p d σ , a σ p b σ q c σ q d σ , a σ q b σ p c σ p d σ , a σ q b σ p c σ q d σ , a σ q b σ q c σ p d σ , a σ q b σ q c σ q d σ .
by lex order of the triple of nullary operations and then by lex order of permutations σ ∈ S 4 : a σ p b σ p c σ p d σ , a σ p b σ p c σ q d σ , a σ p b σ q c σ p d σ , a σ p b σ q c σ q d σ , a σ q b σ p c σ p d σ , a σ q b σ p c σ q d σ , a σ q b σ q c σ p d σ , a σ q b σ q c σ q d σ .

(
)5
The expansion map X 4 : LT (4) → W( 4) is determined by its values on the nonassociative monomials with the identity permutation of the arguments (Fig. 1).We apply all permutations in S 4 to the arguments a, b, c, d in the expansions and store the coefficients in the 192 × 120 matrix E 4 representing X 4 with respect to the ordered bases ( 4) and (5).The (i, j) entry of E 4 is t ( The expansion map X 4 : LT (4) → W( 4) is determined by its values on the nonassociative monomials with the identity permutation of the arguments (Fig. 1).We apply all permutations in S 4 to the arguments a, b, c, d in the expansions and store the coefficients in the 192 × 120 matrix E 4 representing X 4 with respect to the ordered bases ( 4) and (5).The (i, j) entry of E 4 is the coefficient of the ith associative monomial in the expansion of the jth nonassociative monomial.Thus each column of E 4 contains 1 and −1 each four times.Next, we consider the consequences of the Lie-admissible identity.The identity L(a, b, c) ∈ LT (3) is skew-symmetric:

coefficient of the ith associative monomial in the expansion of the jth nonassociative monomial.Thus each column of E 4 contains 1 a
d −1 each four times.Next, we consider the consequences of the Lie-admissible identity.The identity L(a, b, c) ∈ LT (3) is skew-symmetric:
L(a σ , b σ , c σ ) = (σ)L(a, b, c).
We write L ⊂ LT for the operad ide We write L ⊂ LT for the operad ideal generated by L; clearly L ⊆ K.The homogeneous component L( 4) is generated as an S 4 -module by the partial compositions compositions
L • 1 ω = L(ω(a, b), c, d) = L(ab, c, d), ω • 1 L = ω(L(a, b, c), d) = L(a, b, c)d, ω • 2 L = ω(a, L(b, c, d)) = aL(b, c, d). (6)
We refer to the elements of L( 4) as the old identities in degree 4. Applying all permutations σ ∈ S 4 to the generators (6) allows us to represent L(4) as the row space of We refer to the elements of L( 4) as the old identities in degree 4. Applying all permutations σ ∈ S 4 to the generators (6) allows us to represent L(4) as the row space of the 72 × 120 matrix C 4 whose columns are labelled by the monomials (4).The row space of C 4 is a subspace (in fact an S 4 -submodule) of the nullspace of the matrix E 4 .We set o 4 = rank(C 4 ) and write C 4 for the o 4 × 120 matrix in RCF (row canonical form) whose row space equals that of C 4 .Finally, we consider the new identities.The elements of the nullspace of E 4 are the coefficient vectors of K( 4).We set a 4 = nullity(E 4 ) and write N 4 for the a 4 × 120 matrix in RCF whose row space is the nullspace of E 4 .The rows of N 4 span the S 4 -module of all identities in degree 4. Clearly the row space of C 4 is a subspace of the row space of N 4 , and hence o 4 ≤ a 4 .The quotient K(4)/L( 4) is the S 4 -module of new identities in degree 4, and its dimension is lled by the monomials (4).The row space of C 4 is a subspace (in fact an S 4 -submodule) of the nullspace of the matrix E 4 .We set o 4 = rank(C 4 ) and write C 4 for the o 4 × 120 matrix in RCF (row canonical form) whose row space equals that of C 4 .Finally, we consider the new identities.The elements of the nullspace of E 4 are the coefficient vectors of K( 4).We set a 4 = nullity(E 4 ) and write N 4 for the a 4 × 120 matrix in RCF whose row space is the nullspace of E 4 .The rows of N 4 span the S 4 -module of all identities in degree 4. Clearly the row space of C 4 is a subspace of the row space of N 4 , and hence o 4 ≤ a 4 .The quotient K(4)/L( 4) is the S s in degree 4, and its dimension is
a 4 − o 4 .
Let A, O ⊆ {1, . . ., 120} be the column indices of the leading 1 s in N 4 and C 4 respectively.A linear basis of K(4)/L(4) corresponds to (the cosets of) the rows of N 4 whose leading 1 s have c Let A, O ⊆ {1, . . ., 120} be the column indices of the leading 1 s in N 4 and C 4 respectively.A linear basis of K(4)/L(4) corresponds to (the cosets of) the rows of N 4 whose leading 1 s have column indices in A\O.It is straightforward using the module generators algorithm [4] to compute a subset of this linear basis which represents a set of S 4 -module generators for the quotient module.Computations with the computer algebra system SageMath show that a 4 = 88 and hence N 4 has rank n 4 = 32; the nonzero entries of N 4 are ± 1  2 , ±1, − 3 2 .For each row of N 4 , we multiply the coefficients by the LCM of their denominators to obtain integers and then divide by the GCD of these integers to obtain vectors with relatively prime integer coefficients.The squared Euclidean lengths of the resulting vectors with multiplicities in parentheses are 12 (4), 18 (4), 42 (8), 48 (2), 56 (1), 60 (4), 64 (1), 72 (2), 74 (3), 82 (1), 100 (2).
using the module generators algorithm [4] to compute a subset of this linear basis which represents a set of S 4 -module generators for the quotient module.Computations with the computer algebra system SageMath show that a 4 = 88 and hence N 4 has rank n 4 = 32; the nonzero entries of N 4 are ± 1  2 , ±1, − 3 2 .For each row of N 4 , we multiply the coefficients by the LCM of their denominators to obtain integers and then divide by the GCD of these integers to obtain vectors with relatively prime integer coefficients.The squared Euclidean lengths of the resulting vectors with multiplicities in parentheses are 12 (4), 18 (4), 42 (8), 48 (2), 56 (1), 60 (4), 64 (1), 72 (2), 74 (3), 82 (1), 100 (2).

We sort the rows of the new integer matrix, also called N 4 , by increasing length.Further SageMath computations show that o 4 = 19, which implies that the quotient module K(4)/L(4) has dime We sort the rows of the new integer matrix, also called N 4 , by increasing length.Further SageMath computations show that o 4 = 19, which implies that the quotient module K(4)/L(4) has dimension 13.
sion 13.

We next use the module generators algorithm again to determine the smallest subset of the shortest rows of N 4 which generates the quotient module K(4)/L(4).We obtain two identities and verify that neither is a consequence of the other.The first has 18 terms and coefficients ± 1 (squared length 18); the second has 33 terms and coefficients ± 1, ± 2 (squared lengt We next use the module generators algorithm again to determine the smallest subset of the shortest rows of N 4 which generates the quotient module K(4)/L(4).We obtain two identities and verify that neither is a consequence of the other.The first has 18 terms and coefficients ± 1 (squared length 18); the second has 33 terms and coefficients ± 1, ± 2 (squared length 42).
42).

We can obtain better results using linear algebra over the integers; this requires replacing the RCF by the HNF (Hermite normal form), and applying the LLL algorithm [5] to determine shorter integer ve We can obtain better results using linear algebra over the integers; this requires replacing the RCF by the HNF (Hermite normal form), and applying the LLL algorithm [5] to determine shorter integer vectors.
tors.

The entries of the matrix E 4 belong to {0, ±1}.We compute the HNF of the transpose E t 4 , denoted by V , and a square matrix U with det(U ) = ±1 such that UE t 4 = V .Since E t 4 has rank 88, the bottom 32 rows of V are zero, and hence the bottom 32 rows of U form a matrix N whose rows form a lattice basis of the left nullspace of E t 4 (the right nullspace of E 4 ).(By a lattice basis we mean a set of free generators for a submodule of a free Z-modul The entries of the matrix E 4 belong to {0, ±1}.We compute the HNF of the transpose E t 4 , denoted by V , and a square matrix U with det(U ) = ±1 such that UE t 4 = V .Since E t 4 has rank 88, the bottom 32 rows of V are zero, and hence the bottom 32 rows of U form a matrix N whose rows form a lattice basis of the left nullspace of E t 4 (the right nullspace of E 4 ).(By a lattice basis we mean a set of free generators for a submodule of a free Z-module.) .)

After applying the LLL algorithm to the lattice generated by the rows of N , we obtain a matrix N LLL whose nonzero entries are ±1 and whose rows have the following squared Euclidean lengths with multiplicities given in parenthes After applying the LLL algorithm to the lattice generated by the rows of N , we obtain a matrix N LLL whose nonzero entries are ±1 and whose rows have the following squared Euclidean lengths with multiplicities given in parentheses: s:

12 (13), 18 (12), 24 (1), 26 (1), 28 (1), 32 (3), 34 (1).

Further computations show that the quotient module K(4)/L( 4 4) is 32 and the permutation of variables of a multilinear identit 12 (13), 18 (12), 24 (1), 26 (1), 28 (1), 32 (3), 34 (1).
Further computations show that the quotient module K(4)/L( 4 4) is 32 and the permutation of variables of a multilinear identity of degree 4 can produce at most 4! = 24 linearly independent identities, a lower bound on the number of generators of K( 4) as an S 4 -module is 32/24 = 2. Therefore the set of generators {H, I} of K( 4) has minimum cardinal.

Polynomial Identities in Degree 5
Degree 5

In degree 5 there are 14 association types and hence In degree 5 there are 14 association types and hence 14 • 5! = 1680 multilinear nonassociative monomials; there are 5! • 2 4 = 1920 associative pq-monomials.Recall that in degree 4, identities H and I from Definition 4.2 generate the kernel K(4) of the expansion map as an S 4 -module.Each identity U in degree 4 produces six consequences in degree 5: , c, d, e), U(a, bc, d, e), U(a, b, cd, e), U(a, b, c, de),   U (a, b, c, d)e, aU (b, c, d, e).Theorem 5.1.Every identity in degree 5 satisfied by every mutation algebra follows from the consequences of H and I in degree 4, and the new identity G in degree 5 displayed in Fig. 3.

ve monomials; there are 5! • 2 4 =
1920 associative pq-monomials.Recall that in degree 4, identities H and I from Definition 4.2 generate the kernel K(4) of the expansion map as an S 4 -module.
isplayed in Fig. 3.
U (ab
Proof.The proof is similar to that of degree 4. We order the monomial bases of LT (5) and W (5) as in Theorem 4.3.We need to perform computations on the 1920 × 1680 matrix E 5 representing the expansion map X 5 : LT (5) → W (5) (with respect to the monomial bases above).To this end, we use the class of rational sparse matrices in SageMath.

The kernel K(5) of the expansion map is an S 5 -module of dimen Proof.The proof is similar to that of degree 4. We order the monomial bases of LT (5) and W (5) as in Theorem 4.3.We need to perform computations on the 1920 × 1680 matrix E 5 representing the expansion map X 5 : LT (5) → W (5) (with respect to the monomial bases above).To this end, we use the class of rational sparse matrices in SageMath.
The kernel K(5) of the expansion map is an S 5 -module of dimension 778 (comprising all identities).The twelve consequences (in degree 5) of identities H and I generate the S 5 -module O(5) of old identities, which has dimension 747.Hence the quotient module K(5)/O(5) of new identities has dimension 31.We compute the HNF, denoted by V , of E t 5 and a square matrix U with det(U ) = ±1 such that UE t 5 = V .The bottom 778 rows of U produce a matrix N whose rows form a lattice basis of the right nullspace of E 5 .Next, we apply the LLL algorithm to the lattice generated by the rows of N to obtain the matrix N LLL ; we find that the S 5 -module K(5)/O( 5) is generated by one row of N LLL having 48 nonzero ± 1 entries, which is the coefficient vector of identity G(a, b, c, d, e).The computations required around 4 GB of RAM, and had a runtime of 90 min, in an AMD Ryzen 5 5600X processor at 3.70 GHz running SageMath 9.2 on Windows 10.
ion 778 (comprising all identities).The twelve consequences (in degree 5) of identities H and I generate the S 5 -module O(5) of old identities, which has dimension 747.Hence the quotient module K(5)/O(5) of new identities has dimension 31.We compute the HNF, denoted by V , of E t 5 and a square matrix U with det(U ) = ±1 such that UE t 5 = V .The bottom 778 rows of U produce a matrix N whose rows form a lattice basis of the right nullspace of E 5 .Next, we apply the LLL algorithm to the lattice generated by the rows of N to obtain the matrix N LLL ; we find that the S 5 -module K(5)/O( 5) is generated by one row of N LLL having 48 nonzero ± 1 entries, which is the coefficient vector of identity G(a, b, c, d, e).The computations required around 4 GB of RAM, and had a runtime of 90 min, in an AMD Ryzen 5 5600X processor at 3.70 GHz running SageMath 9.2 on Windows 10.

Remark 5.2.The dimension of K( 5) is 778 and permuting the variables Remark 5.2.The dimension of K( 5) is 778 and permuting the variables of a multilinear identity of degree 5 can produce at most 5! = 120 linearly independent identities, so a lower bound on the number of generators of K( 5) as an S 5 -module is 778/120 = 7.In Theorem 5.1 we have obtained a set with 13 generators: the 12 consequences of identities H and I plus a new identity G.In fact, it can be checked that K( 5) is already generated by identity G, the consequences of identity I, and consequences H(ab , c, d, e), H(a, b, c, d)e  and aH(b, c, d, e) of identity H. Therefore an upper bound on the minimum number of generators of K( 5) as an S 5 -module is 10.
f a multilinear identity of degree 5 can produce at most 5! = 120 linearly independent identities, so a lower bound on the number of generators of K( 5) as an S 5 -module is 778/120 = 7.In Theorem 5.1 we have obtained a set with 13 generators: the 12 consequences of identities H and I plus a new identity G.In fact, it can be checked that K( 5) is already generated by identity G, the consequences of identity I, and consequences H(ab , c, d, e), H(a, b, c, d)e  and aH(b, c, d, e) of identity H. Therefore an upper bound on the minimum number of generators of K( 5) as an S 5 -module is 10.


Polynomial Identities in Degree 6

In degree 6 there are 42 associ

Polynomial Identities in Degree 6
In degree 6 there are 42 association types and hence 42 • 6! = 30,240 multilinear nonassociative monomials, and there are 6! • 2 5 = 23,040 associative pq-monomials.So, to represent the expansion map X 6 as a whole we would need to use a matrix of size 30, 240 × 23, 040, which is too large to manipulate with our computer system.We use the representation theory of the symmetric group to reduce the problem to a set of matrices of smaller sizes and demonstrate the existence of a number of new identities in degree 6.We choose a set of conjugacy class representatives in S 6 and calculate the matrices representing these permutations on the modules of old and all identities.Comparing the traces of these matrices with the character table of S 6 , we obtain the multiplicities of the irreducible representations of the S 6 -modules.Theorem 6.1.For each of the 11 partitions λ of 6, the following table contains the multiplicity of each irreducible representation in the S 6 -modules of all identities (the kernel of the expansion map), the old identities (the consequences of the identities of lower degree), and the quotient module of new identities (the difference of the previous two multiplicities): By the previous theorem, the number of generators of the S 6 -module of new identities is at least 10449/6!= 15.This observation motivates the next conjecture.Conjecture 6.2.The kernel of the expansion map in all degrees, that is, the operad ideal K = n≥1 K(n) (see Definition 2.2), is not finitely generated.In other words, no finite set of identities generates all the identities satisfied by all mutation algebras.

ion types and hence 42 • 6! = 30,2
0 multilinear nonassociative monomials, and there are 6! • 2 5 = 23,040 associative pq-monomials.So, to represent the expansion map X 6 as a whole we would need to use a matrix of size 30, 240 × 23, 040, which is too large to manipulate with our computer system.We use the representation theory of the symmetric group to reduce the problem to a set of matrices of smaller sizes and demonstrate the existence of a number of new identities in degree 6.We choose a set of conjugacy class representatives in S 6 and calculate the matrices representing these permutations on the modules of old and all identities.Comparing the traces of these matrices with the character table of S 6 , we obtain the multiplicities of the irreducible representations of the S 6 -modules.Theorem 6.1.For each of the 11 partitions λ of 6, the following table contains the multiplicity of each irreducible representation in the S 6 -modules of all identities (the kernel of the expansion map), the old identities (the consequ nces of the identities of lower degree), and the quotient module of new identities (the difference of the previous two multiplicities): By the previous theorem, the number of generators of the S 6 -module of new identities is at least 10449/6!= 15.This observat on motivates the next conjecture.Conjecture 6.2.The kernel of the expansion map in all degrees, that is, the operad ideal K = n≥1 K(n) (see Definition 2.2), is not finitely generated.In other words, no finite set of identities generates all the identities satisfied by all mutation algebras.



Proof.It is straightforward to verify that ker X n = {0} for 1 ≤ n ≤ 2. The monomial basis of LT (3) consists of 12 elements ordered first by association type and then by permutation of the variables: (ab)c, (ac)b, (ba)c, (bc)a, (ca)b, (cb)a, a(bc), a(cb), b(ac), b(ca), c(ab), c(ba).


Definition 4 . 1 .
41
In a nonassociative algebra, the linearized Jordan identity is ((bc)a)d + ((bd)a)c + Proof.It is straightforward to verify that ker X n = {0} for 1 ≤ n ≤ 2. The monomial basis of LT (3) consists of 12 elements ordered first by association type and then by permutation of the variables: (ab)c, (ac)b, (ba)c, (bc)a, (ca)b, (cb)a, a(bc), a(cb), b(ac), b(ca), c(ab), c(ba).

Figure 2 .Definition 4 . 2 . 3 (
Figure 2. The matrix E 3 representing the expansion map X 3 (here a dot represents a zero entry)

Theorem 4 . 3 .
. 3 .
43
Every identity in degree 4 satisfied by every mutation algebra follow Every identity in degree 4 satisfied by every mutation algebra follows from the identities H and I from Definition 4.2.

from the i
) is generated by two rows of N LLL with squared length 18.These are the coefficient vectors of the identitiesI(a, b, c, d) and H(a, b, c, d).Moreover, the S 4 -module generated by I(a, b, c, d) and H(a, b, c, d) has dimension 32, so it coincides with K(4).

Remark 4 . 4 .
Since the dimension of K(

Figure 3 .
Figure 3.The new identity in degree 5

Furthermore
, the dimension of the quotient module of new identities isλ new(λ) dim(λ) = 10449.Proof.These methods have been described in detail in[4,].

Funding
Open access funding provided by FCT-FCCN (b-on).Murray Bremner was supported by the Discovery Grant Algebraic Operads from NSERC, the Natural Sciences and Engineering Research Council of Canada.Jose Brox was supported by the Portuguese Government through grant SFRH/BPD/118665/ 2016 (FCT/Centro 2020/Portugal 2020/ESF).Juana Sánchez-Ortega was supported by a CSUR grant from the NRF, the National Research Foundation of South Africa.This work was partially supported by the Centre for Mathematics of the University of Coimbra-UID/MAT/00324/2020, funded through FCT/MCTES, Fundação para a Ciência e a Tecnologia/Ministério da Ciência, Tecnologia e Ensino Superior de Portugal.

he University o
1 ) μ n2 (t 2 ) ).We omit the outermost pair of parentheses corresponding to the root of the tree.)Ift 1 ∈ T n1 and t 2 ∈ T n2 then the partial composition t 1 • i t 2 ∈ T n1+n2−1 for 1 ≤ i ≤ n 1 is obtained by grafting the right tree into the left at position i: that is, identifying leaf i of t 1 (from left to right) with the root of t 2 .

Free Symmetric Operad Consider
an integer n ≥ 1 and the set of indeterminates {x 1 , . . ., x n }.We write S n for the symmetric group of all n! permutations of {1, . . ., n}.For each α ∈ S n and t ∈ T n we obtain the labelled tree αt consisting of t with leaves labelled α(1), . . ., α(n) from left to right.We write LT n for the set of all such labelled trees.Similarly, we apply the association type μ n (t) for t ∈ T n to the multilinear associative monomial x α(1) • • • x α(n) and obtain the nonassociative monomial αμ n (t).We write LU n for the set of all such nonassociative monomials.The bijection μ n : T n → U n extends in the obvious way to the bijection λμ n : LT n → LU n .